An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
نویسندگان
چکیده
منابع مشابه
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
Lambda-lifting and lambda-dropping respectively transform a blockstructured functional program into recursive equations and vice versa. Lambda-lifting was developed in the early 80’s, whereas lambda-dropping is more recent. Both are split into an analysis and a transformation. Published work, however, has only concentrated on the analysis parts. We focus here on the transformation parts and mor...
متن کاملImproved Graph-Based Lambda Lifting
Lambda lifting is a technique for transforming a program with local function definitions into a program consisting only of global function definitions. The best known lambda lifting algorithm computes the minimal set of extraneous parameters needed by each function in O(n) steps by solving a system of set equations which are recursive if the functions in the program are mutually recursive. Mutu...
متن کاملExtensional Models of Typed Lambda-mu Calculus
This paper shows that the stream models of Nakazawa and Katsumata can be adapted to a typed setting for an extension of the Λμcalculus, called Λμcons. It shows the typed Λμcons is sound and complete with respect to the stream models. It also shows that any individual stream model with whole function spaces and infinite bases characterizes the extensional equality. This result corresponds to Fri...
متن کاملExtensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملLambda-Lifting in Quadratic Time
Lambda-lifting is a program transformation used in compilers and in partial evaluators and that operates in cubic time. In this article, we show how to reduce this complexity to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting transforms a block-structured program into a set of recursive equations, one for each local function in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1999
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v6i21.20078